Designing Organized Multiagent Systems through MDPs
نویسندگان
چکیده
In this paper we present an approach to design an Organized Multiagent Systems (OMAS) for teamwork. We use a general formal model for OMAS that employs the notion of organizational mechanisms. The purpose of such mechanisms is influencing the behaviour of the agents towards more effectiveness with regard to some objectives. To achieve our goal we use Markov Decision Processes (MDPs) as a framework to design the organizational mechanisms. In order to illustrate our approach we use the medical emergencies domain where ambulances have to be selected in order to assist and transport patients to the hospitals.
منابع مشابه
Heuristic Planning for Decentralized MDPs with Sparse Interactions
In this work, we explore how local interactions can simplify the process of decision-making in multiagent systems, particularly in multirobot problems. We review a recent decision-theoretic model for multiagent systems, the decentralized sparse-interaction Markov decision process (Dec-SIMDP), that explicitly distinguishes the situations in which the agents in the team must coordinate from those...
متن کاملSafe Stochastic Planning: Planning to Avoid Fatal States
Markov decision processes (MDPs) are applied as a standard model in Artificial Intelligence planning. MDPs are used to construct optimal or near optimal policies or plans. One area that is often missing from discussions of planning under stochastic environment is how MDPs handle safety constraints expressed as probability of reaching threat states. We introduce a method for finding a value opti...
متن کاملExploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs (Extended Version)
Many exact and approximate solution methods for Markov Decision Processes (MDPs) attempt to exploit structure in the problem and are based on factorization of the value function. Especially multiagent settings, however, are known to suffer from an exponential increase in value component sizes as interactions become denser, meaning that approximation architectures are restricted in the problem s...
متن کاملExploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs
Many solution methods for Markov Decision Processes (MDPs) exploit structure in the problem and are based on value function factorization. Especially multiagent settings, however, are known to suffer from an exponential increase in value component sizes as interactions become denser, restricting problem sizes and types that can be handled. We present an approach to mitigate this limitation for ...
متن کاملAn extended study on addressing defender teamwork while accounting for uncertainty in attacker defender games using iterative Dec-MDPs
Multi-agent teamwork and defender-attacker security games are two areas that are currently receiving significant attention within multi-agent systems research. Unfortunately, despite the need for effective teamwork among multiple defenders, little has been done to harness the teamwork
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009